“北斗”卫星导航系统的概述与应用

"北斗"卫星导航系统是我国自主研发、独立运行的卫星导航系统,对于国防和经济建设有着非常重要的作用,自2012年12月27日正式提供导航服务以来,在国防和经济建设中发挥着重要的作用。本文就"北斗"的组成、功能、特点、应用及发展前景进行简述,旨在让读者了解"北斗"卫星导航系统基本知识。     

BDS三频非差观测数据周跳探测与修复方法

随着三频技术的出现,多频观测量及其丰富的线性组合特性为周跳的探测与修复提供了新的契机。因此提出三频非差观测量线性组合对载波相位观测数据中周跳进行实时探测及修复的方法。该方法构造无几何无电离层的码相组合,并通过对历元间的电离层延迟变化量进行实时估计与消除,构造出第三组线性无关的周跳探测量。用30 s采样间隔的北斗三频实测数据对算法性能进行验证,试验结果表明:该方法可以有效地对各频点的周跳实现探测与修复,即使在电离层活跃的应用场景中,该方法依然具有较好的性能。     

M/G/1(RVT,P(j))排队系统的另一分析方法及其应用

M/G/1(RVT,P(j))表示服务员具有随机长度休息时间(RVT)的、且一休息时间结束时有 j 个顾客等待的概率为 P(j)的、修正的 M/G/1 排队系统。我们用嵌入 Markov 链的技术已详细地分析过这一排队系统,这里提供另一分析方法。最后,应用这个排队系统的分析结果,对时隙 ALOHA 卫星公用信道的分组碰撞概率计算公式作了推导。     

Hill 方程在远距离拦截中的应用

提出了一种通过坐标系移动,化原系中的大相对距离为新系中的小相对距离,以减小Ｈｉｌｌ方程在大相对距离时的模型误差的方法,即当拦截器的相对距离达到某一精度许可的值ρ＿１时（定义ρ＿１为精度控制参数,例如可取ρ＿１＝５００ｋｍ）,以拦截器位置为原点,建立一假想的动参考系,将拦截器在原动系中的相对运动参数转换为新系中的相对运动参数（显然在新系中的初始相对距离）,从而化大相对距离为小相对距离问题,提高Ｈｉｌｌ方程的描述精度。本文给出了方法的理论分析及两个计算机仿真实例,该法确可有效地减小Ｈｉｌｌ方程在大相对距离时的模型误差,结果是令人满意的。     

利用星载GPS伪码测距进行小卫星星座的整网定位

首先针对小卫星星载ＧＰＳ伪码测距，基于星间差分消除／消弱误差，并引入星座网形约束，论述了星座模式下提高小卫星定位精度的一种整网数据处理方法，并给出了一个算例。然后进一步论述了不依赖ＧＰＳ的小卫星星座测控，以及提高小卫星星座定位自主性问题的几点设想。     

使用等效偏移角稀疏测量的面阵相机序贯图像几何校正

天基光学相机实际在轨对地观测成像的畸变需通过几何校正抑制。目前主流面阵相机对地观测获得的小尺寸、高帧频序贯图像很难满足传统几何校正方法逐帧解算对单帧图像控制点数量与空域分布的要求且计算量巨大。针对这一问题,提出一种使用等效偏移角稀疏测量的面阵相机序贯观测图像几何校正方法,将逐帧校正参数解算问题转化为时域稀疏测量条件下等效偏移角信号恢复问题,利用等效偏移角信号时频信息可有效降低对单帧图像控制点数量和空域分布要求。通过高分四号卫星面阵相机在轨实测图像数据验证了所提方法的可行性且其能大大降低序贯图像几何校正处理的计算量。     

Benders' cuts guided large neighborhood search for the traveling umpire problem

This article introduces the use of Benders' cuts to guide a large neighborhood search to solve the traveling umpire problem, a sports scheduling problem inspired by the real‐life needs of the officials of a sports league. At each time slot, a greedy matching heuristic is used to construct a schedule. When an infeasibility is recognized first a single step backtracking is tried to resolve the infeasibility. If unsuccessful, Benders' cuts are generated to guide a large neighborhood search to ensure feasibility and to improve the solution. Realizing the inherent symmetry present in the problem, a large family of cuts are generated and their effectiveness is tested. The resulting approach is able to find better solutions to many instances of this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Polynomial‐time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time

In this article, we consider the concurrent open shop scheduling problem to minimize the total weighted completion time. When the number of machines is arbitrary, the problem has been shown to be inapproximable within a factor of 4/3 ‐ ε for any ε > 0 if the unique games conjecture is true in the literature. We propose a polynomial time approximation scheme for the problem under the restriction that the number of machines is fixed. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Batch scheduling on a two‐machine jobshop with machine‐dependent setup times

The problem of minimum makespan on an m machine jobshop with unit execution time (UET) jobs (m ≥ 3) is known to be strongly NP‐hard even with no setup times. We focus in this article on the two‐machine case. We assume UET jobs and consider batching with batch availability and machine‐dependent setup times. We introduce an efficient \begin{align*}(O(\sqrt{n}))\end{align*} algorithm, where n is the number of jobs. We then introduce a heuristic for the multimachine case and demonstrate its efficiency for two interesting instances. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem

The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011